Some Topics on Convex Optimization
نویسندگان
چکیده
منابع مشابه
Selected topics in robust convex optimization
Robust Optimization is a rapidly developing methodology for handling optimization problems affected by non-stochastic “uncertain-butbounded” data perturbations. In this paper, we overview several selected topics in this popular area, specifically, (1) recent extensions of the basic concept of robust counterpart of an optimization problem with uncertain data, (2) tractability of robust counterpa...
متن کاملSome Results on Convex Spectral Functions: I
In this paper, we give a fundamental convexity preserving for spectral functions. Indeed, we investigate infimal convolution, Moreau envelope and proximal average for convex spectral functions, and show that this properties are inherited from the properties of its corresponding convex function. This results have many applications in Applied Mathematics such as semi-definite programmings and eng...
متن کاملOn convex optimization without convex representation
We consider the convex optimization problem P : minx{f(x) : x ∈ K} where f is convex continuously differentiable, and K ⊂ R is a compact convex set with representation {x ∈ R : gj(x) ≥ 0, j = 1, . . . ,m} for some continuously differentiable functions (gj). We discuss the case where the gj ’s are not all concave (in contrast with convex programming where they all are). In particular, even if th...
متن کاملOn Some Mathematical Topics in Classic Synchronization
A few mathematical problems arising in the classical synchronization theory are discussed; especially those relating to complex dynamics. The roots of the theory originate in the pioneering experiments by van der Pol and van der Mark, followed by the theoretical studies done by Cartwright and Littlewood. Today we focus specifically on the problem on a periodically forced stable limit cycle emer...
متن کاملSome topics on similarity metric learning
The success of many computer vision problems and machine learning algorithms critically depends on the quality of the chosen distance metrics or similarity functions. Due to the fact that the real-data at hand is inherently taskand data-dependent, learning an appropriate distance metric or similarity function from data for each specific task is usually superior to the default Euclidean distance...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2021
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1818/1/012171